use small_map::SmallMap;
use crate::linked_list::LinkedList;
// Don't worry about the 16 here.
// When the size grows, it will automatically switch to heap impl.
type MySmallMap<K, V> = SmallMap<16, K, V>;

#[test]
fn test1() {
    let mut map = MySmallMap::new();
    map.insert(1_u8, 2_u8);
    assert_eq!(*map.get(&1).unwrap(), 2);
}

#[test]
fn test_linked_list() {
    let mut li = LinkedList::new();
    li.debug_print();
    for i in 0..10 {
        li.push_back(i);
    }
    li.debug_print();
    for _ in 0..5 {
        li.pop_back()
    }
    li.debug_print();
}
